Parallelizing SHA-1

نویسندگان

  • Hu-ung Lee
  • Seongjin Lee
  • Jae-woon Kim
  • Youjip Won
چکیده

In this paper, we propose the parallel architecture for high speed calculations of SHA-1, a widely used cryptographic hash function. Parallel SHA-1 consists of a number of base modules which process the message digest in parallel manner. The base module uses state of art SHA-1 acceleration techniques: loop unfolding, pre-processing, and pipelining. We achieved the performance improvement of 5.8% over the pipeline architecture that is known to have nearly achieved the theoretical performance limit. We implemented our system on the Xilinx Virtex-6 FPGA and verified the operations by interfacing it with MicroBlaze soft processor core.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Simultaneous hashing of multiple messages

We describe a method for efficiently hashing multiple messages of different lengths. Such computations occur in various scenarios, and one of them is when an operating system checks the integrity of its components during boot time. These tasks can gain performance by parallelizing the computations and using SIMD architectures. For such scenarios, we compare the performance of a new 4-buffers SH...

متن کامل

Relaxed Differential Fault Analysis of SHA-3

In this paper, we propose a new method of differential fault analysis of SHA-3 which is based on the differential relations of the algorithm. Employing those differential relations in the fault analysis of SHA-3 gives new features to the proposed attacks, e.g., the high probability of fault detection and the possibility of re-checking initial faults and the possibility to recover internal state...

متن کامل

On Collisions of Hash Functions Turbo SHA-2

In this paper we don't examine security of Turbo SHA-2 completely; we only show new collision attacks on it, with smaller complexity than it was considered by Turbo SHA-2 authors. In [1] they consider Turbo SHA-224/256r and Turbo SHA-384/512-r with variable number of rounds r from 1 to 8. The authors of [1] show collision attack on Turbo SHA-256-1 with one round which has the complexity of 2. F...

متن کامل

مروری بر حملات مکعبی، خطای تفاضلی و ساختارهای خطی بر روی تابع کچک(SHA-3)

در سال‌های اخیر بررسی امنیت سومین تابع چکیده‌ساز امن[1] یکی از مهم‌ترین موضوعات مورد توجه پژوهش­گران حوزه رمزنگاری بوده ‌است. توابع چکیده‌ساز در رمزنگاری کاربردهای متعددی دارند. از این­رو امنیت توابع چکیده‌ساز در مقابل حملات مختلف برای سامانه‌هایی که از آن استفاده می‌کنند، بسیار مهم است. حملات و تحلیل‌های متعددی تا امروز بر روی SHA-3 اعمال شده ‌است؛ اما تاکنون هیچ­کدام موفق به شکستن آن به‌صورت ...

متن کامل

Keyed/Unkeyed SHA-2

In the draft FIPS 180-2, NIST published SHA-2 as a new version of secure hash algorithm. SHA-2 offers four secure hash algorithms including SHA-1, SHA-256, SHA-384, and SHA-512. In other words, SHA-2 may have outputs 160, 256, 384, or 512 bits of message digest. However, SHA-2 algorithm uses fixed and predefined parameters in execution. It may be vulnerable to attacks. In this paper, we propose...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEICE Electronic Express

دوره 12  شماره 

صفحات  -

تاریخ انتشار 2015